منابع مشابه
Shortest Paths in Distance-regular Graphs
We aim here at introducing a new point of view of the Laplacian of a graph, Γ. With this purpose in mind, we consider L as a kernel on the finite space V (Γ), in the context of the Potential Theory. Then we prove that L is a nice kernel, since it verifies some fundamental properties as maximum and energy principles and the equilibrium principle on any proper subset of V (Γ). If Γ is a proper se...
متن کاملRecovering tree-child networks from shortest inter-taxa distance information
Phylogenetic networks are a type of leaf-labelled, acyclic, directed graph used by biologists to represent the evolutionary history of species whose past includes reticulation events. A phylogenetic network is tree-child if each non-leaf vertex is the parent of a tree vertex or a leaf. Up to a certain equivalence, it has been recently shown that, under two different types of weightings, edge-we...
متن کاملOn Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n × n matrix storing the All-Pairs-Shortest-Path distances in G. Since D contains integers in [n]∪+∞, its plain storage takes n log(n+1) bits. However, a simple counting argument shows that n/2 bits are necessary to store D. In this paper we investigate the question of finding a succinct representation of D that requires O...
متن کاملAnimal Communication: Laughter Is the Shortest Distance between Two Apes
New acoustic analyses of the calls of great apes and humans in response to tickling reveal the probable evolutionary history of laughter in humans and our nearest living relatives, the great apes.
متن کاملShortest path distance in random k-nearest neighbor graphs
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Navigation
سال: 1994
ISSN: 0373-4633,1469-7785
DOI: 10.1017/s037346330001119x